Solving Dock Allocation Problem Using Improved Chemical Reaction Algorithm
نویسندگان
چکیده مقاله:
Container terminals are places where cargo is transported from point to point using special equipment. One of the most important issues in planning coastal operations at container terminals is the issue of the planning of the embankment or quay, which has a significant impact on crane, yard, warehouse and truck routing programs. This research involved a basin planning model with a multi-pier simultaneous planning approach in a port. An improved chemical reaction algorithm was used to solve this model. The CRO algorithm is an effective algorithm for searching for optimal or near optimal solutions. This algorithm has a variable population that sometimes slows down the algorithm or renders some of its operators unusable. In this study, it is attempted to keep the population of the algorithm in proper range. To evaluate the proposed method, we investigate the scheduling results of the proposed method with three algorithms DE, GA and PSO. By reducing ship expectations, the port in question can be more successful in competing with nearby ports by increasing the satisfaction of shipping companies and delivering higher productivity and profitability.
منابع مشابه
the algorithm for solving the inverse numerical range problem
برد عددی ماتریس مربعی a را با w(a) نشان داده و به این صورت تعریف می کنیم w(a)={x8ax:x ?s1} ، که در آن s1 گوی واحد است. در سال 2009، راسل کاردن مساله برد عددی معکوس را به این صورت مطرح کرده است : برای نقطه z?w(a)، بردار x?s1 را به گونه ای می یابیم که z=x*ax، در این پایان نامه ، الگوریتمی برای حل مساله برد عددی معکوس ارانه می دهیم.
15 صفحه اولSolving Redundancy Allocation Problem with Repairable Components Using Genetic Algorithm and Simulation Method
Reliability optimization problem has a wide application in engineering area. One of the most important problems in reliability is redundancy allocation problem (RAP). In this research, we worked on a RAP with repairable components and k-out-of-n sub-systems structure. The objective function was to maximize system reliability under cost and weight constraints. The aim was determining optimal com...
متن کاملSolving the Graph Planarization Problem Using an Improved Genetic Algorithm
An improved genetic algorithm for solving the graph planarization problem is presented. The improved genetic algorithm which is designed to embed a graph on a plane, performs crossover and mutation conditionally instead of probability. The improved genetic algorithm is verified by a large number of simulation runs and compared with other algorithms. The experimental results show that the improv...
متن کاملSolving the Unit Commitment Problem Using Modified Imperialistic Competition Algorithm
One of the most important problems for power system operation is unit commitment (UC), for which different constraints should be satisfied. UC is a nonlinear and large-scale problem; thus, using the evolutionary algorithms has been considered for solving the problem. In this paper, the solution of the UC problem was investigated using Modified Imperialistic Competition Algorithm (MICA). Simula...
متن کاملA Hybrid Genetic Algorithm for Solving Facility Location- Allocation Problem
Today’s logistic systems in companies depend on optimum solutions of Facility Location-Allocation (FLA) problems in order to minimize cost values the company is dealing with. Therefore, FLA plays an important role in nowadays business environment. In this paper, a Hybrid Genetic Algorithm (HGA) is proposed to solve FLA. The HGA is a combination of Genetic Algorithm and Tabu Search while NSGA II...
متن کاملSolving a Redundancy Allocation Problem by a Hybrid Multi-objective Imperialist Competitive Algorithm
A redundancy allocation problem (RAP) is a well-known NP-hard problem that involves the selection of elements and redundancy levels to maximize the system reliability under various system-level constraints. In many practical design situations, reliability apportionment is complicated because of the presence of several conflicting objectives that cannot be combined into a single-objective functi...
متن کاملمنابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ذخیره در منابع من قبلا به منابع من ذحیره شده{@ msg_add @}
عنوان ژورنال
دوره 17 شماره 4
صفحات 117- 135
تاریخ انتشار 2020-12
با دنبال کردن یک ژورنال هنگامی که شماره جدید این ژورنال منتشر می شود به شما از طریق ایمیل اطلاع داده می شود.
کلمات کلیدی برای این مقاله ارائه نشده است
میزبانی شده توسط پلتفرم ابری doprax.com
copyright © 2015-2023